Complexity results for single-machine scheduling with positional learning effects
نویسندگان
چکیده
منابع مشابه
Single Machine Scheduling Problems with Time-dependent Learning Effects
In traditional scheduling problems, most literature assumes that the processing time of a job is fixed. However, there are many situations where the processing time of a job depends on the starting time or the position of the job in a sequence. In such situations, the actual processing time of a job may be more or less than its normal processing time if it is scheduled later. This phenomenon is...
متن کاملJIT single machine scheduling problem with periodic preventive maintenance
This article investigates a JIT single machine scheduling problem with a periodic preventive maintenance. Also to maintain the quality of the products, there is a limitation on the maximum number of allowable jobs in each period. The proposed bi-objective mixed integer model minimizes total earliness-tardiness and makespan simultaneously. Due to the computational complexity of the problem, mult...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملMultiprocessor scheduling with machine eligibility: Time complexity results
Polynomially solvable NP-hard pseudopolynomially solvable Strongly NP-hard P M j , p j = 1 Cmax R M j , pmtn ∗ Cmax P2 |M j | = 2 Cmax Pm |M j | = 2 Cmax Rm M j Cmax P |M j | = 2 Cmax
متن کاملSingle machine scheduling problems with financial resource constraints: Some complexity results and properties
We consider single machine scheduling problems with a non-renewable resource. This type of problems has not been intensively investigated in the literature so far. For several problems of this type with standard objective functions (namely the minimization of makespan, total tardiness, number of tardy jobs, total completion time and maximum lateness), we present some complexity results. Particu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operational Research Society
سال: 2008
ISSN: 0160-5682,1476-9360
DOI: 10.1057/palgrave.jors.2602622